Compact Elliptic Curve Scalar Multiplication with a Secure Generality
نویسندگان
چکیده
منابع مشابه
A Compact Architecture for Montgomery Elliptic Curve Scalar Multiplication Processor
We propose a compact architecture of a Montgomery elliptic curve scalar multiplier in a projective coordinate system over GF (2). To minimize the gate area of the architecture, we use the common Z projective coordinate system where a common Z value is kept for two elliptic curve points during the calculations, which results in one register reduction. In addition, by reusing the registers we are...
متن کاملFast GPGPU-Based Elliptic Curve Scalar Multiplication
This paper presents a fast implementation to compute the scalar multiplication of elliptic curve points based on a General-Purpose computing on Graphics Processing Units (GPGPU) approach. A GPU implementation using Dan Bernstein's Curve25519, an elliptic curve over a 255-bit prime eld complying with the new 128-bit security level, computes the scalar multiplication in less than a microsecond on...
متن کاملAtomicity Improvement for Elliptic Curve Scalar Multiplication
Abstract. In this paper we address the problem of protecting elliptic curve scalar multiplication implementations against side-channel analysis by using the atomicity principle. First of all we reexamine classical assumptions made by scalar multiplication designers and we point out that some of them are not relevant in the context of embedded devices. We then describe the state-of-the-art of at...
متن کاملElliptic Curve Cryptosystems and Scalar Multiplication
One of the most used cryptosystems in the world is the RSA system. Its popularity is due to its high security level. In the last decades, the studies have shown that the cryptosystems based on elliptic curves have the same security level as the RSA system. Besides that, the elliptic curve cryptosystems have a higher efficiency and they use shorter keys. In this paper we describe basics of the e...
متن کاملLattice Attacks Against Elliptic-Curve Signatures with Blinded Scalar Multiplication
Elliptic curve cryptography is today the prevailing approach to get efficient public-key cryptosystems and digital signatures. Most of elliptic curve signature schemes use a nonce in the computation of each signature and the knowledge of this nonce is sufficient to fully recover the secret key of the scheme. Even a few bits of the nonce over several signatures allow a complete break of the sche...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2020
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.28.464